Welcome![Sign In][Sign Up]
Location:
Search - decision-making problem

Search list

[Other resourceC45Rule-PANE

Description: 决策树 C45Rule-PANE算法 解决了决策的问题,是从QUILAN算法修改而成-Decision Tree C45Rule - PANE algorithm to solve the problem of decision-making, from QUILAN algorithm revisions
Platform: | Size: 7845 | Author: 黎平 | Hits:

[Other resourcebeibaowenti007

Description: 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n),使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the benefits should be. To make an optimal decision-making sequence Xi (i = 1 ~ n), and makes the ultimate effectiveness of the largest.
Platform: | Size: 9109 | Author: nanaleer | Hits:

[Other resourceExpert_Choice[1]

Description: Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the expertise of the decision maker , not the computer . Behavioral scientists have spent many years studying the human mind and how it makes decisions . They have found that humans are influenced by their previous experiences and this causes them to have biases . Basic instincts , preferences and environmental factors also play key roles in how we analyze data and make decisions . There 15 way to remove these factors from human decision making , nor would we necessarily want to , but as the problems of our world become more and more complex , it 15 necessary for us to employ a framework to help make more logical and less biased decisions while still taking our feelings and intuition into consideration . -Expert Choice represents a significant co ntribution to the decision making process as for t sists a decision maker in solving complex probl ems involving many criteria and several course s of action. An Expert Choice solution to a probl em reflects the expertise of the decision maker , not the computer. Behavioral scientists have spent many years studying the human mind and how it makes decisions. They have found that humans are influenced by their previous experiences a nd this causes them to have biases. Basic instin ctc. preferences and environmental factors also pl ay key roles in how we analyze data and make decis ions. There fifteen way to remove these factors from h Uman decision making. nor would we necessarily want to, but as the problems of our world become more and m ore comple
Platform: | Size: 7298463 | Author: chasesh | Hits:

[Other resourceDynamic_Programming

Description: 多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解; 对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果,与贪婪算法不同的是,在贪婪算法中,每采用一次贪婪准则,便做出一个不可撤回的决策;而在动态规划算法中,还要考察每个最优决策序列中是否包含一个最优决策子序列,即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Platform: | Size: 3241 | Author: 汤烈 | Hits:

[Mathimatics-Numerical algorithms倒酒问题

Description: 倒酒问题描述: 设有两个能装8两的酒杯(称为1号,2号)装满了酒, 和1个能装3两的空酒杯(称为3号), 问怎样用这3个酒杯向4个人 敬酒, 使得每个人都喝4两酒. 要求: 用程序计算出可行方案。 输入: 无 输出: 每一步决策.-down quite Problem description : two can be loaded with two of the eight glasses (known as 1, 2) filled with the wine, and one can hold three two empty glasses (known as the 3rd) and asked how to use it three to four glasses and toast the individual, so that each person maximum servings of both types 4 2 liquor. Request : procedures calculated options. Input : None output : each step of the decision-making.
Platform: | Size: 9290 | Author: | Hits:

[Mathimatics-Numerical algorithms倒酒问题

Description: 倒酒问题描述: 设有两个能装8两的酒杯(称为1号,2号)装满了酒, 和1个能装3两的空酒杯(称为3号), 问怎样用这3个酒杯向4个人 敬酒, 使得每个人都喝4两酒. 要求: 用程序计算出可行方案。 输入: 无 输出: 每一步决策.-down quite Problem description : two can be loaded with two of the eight glasses (known as 1, 2) filled with the wine, and one can hold three two empty glasses (known as the 3rd) and asked how to use it three to four glasses and toast the individual, so that each person maximum servings of both types 4 2 liquor. Request : procedures calculated options. Input : None output : each step of the decision-making.
Platform: | Size: 9216 | Author: | Hits:

[AI-NN-PRC45Rule-PANE

Description: 决策树 C45Rule-PANE算法 解决了决策的问题,是从QUILAN算法修改而成-Decision Tree C45Rule- PANE algorithm to solve the problem of decision-making, from QUILAN algorithm revisions
Platform: | Size: 7168 | Author: 黎平 | Hits:

[Data structsbeibaowenti007

Description: 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n),使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the benefits should be. To make an optimal decision-making sequence Xi (i = 1 ~ n), and makes the ultimate effectiveness of the largest.
Platform: | Size: 9216 | Author: | Hits:

[AlgorithmExpert_Choice[1]

Description: Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the expertise of the decision maker , not the computer . Behavioral scientists have spent many years studying the human mind and how it makes decisions . They have found that humans are influenced by their previous experiences and this causes them to have biases . Basic instincts , preferences and environmental factors also play key roles in how we analyze data and make decisions . There 15 way to remove these factors from human decision making , nor would we necessarily want to , but as the problems of our world become more and more complex , it 15 necessary for us to employ a framework to help make more logical and less biased decisions while still taking our feelings and intuition into consideration . -Expert Choice represents a significant co ntribution to the decision making process as for t sists a decision maker in solving complex probl ems involving many criteria and several course s of action. An Expert Choice solution to a probl em reflects the expertise of the decision maker , not the computer. Behavioral scientists have spent many years studying the human mind and how it makes decisions. They have found that humans are influenced by their previous experiences a nd this causes them to have biases. Basic instin ctc. preferences and environmental factors also pl ay key roles in how we analyze data and make decis ions. There fifteen way to remove these factors from h Uman decision making. nor would we necessarily want to, but as the problems of our world become more and m ore comple
Platform: | Size: 7298048 | Author: chasesh | Hits:

[Data structsDynamic_Programming

Description: 多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解; 对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果,与贪婪算法不同的是,在贪婪算法中,每采用一次贪婪准则,便做出一个不可撤回的决策;而在动态规划算法中,还要考察每个最优决策序列中是否包含一个最优决策子序列,即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Platform: | Size: 3072 | Author: 汤烈 | Hits:

[Other systemswangluochonggou

Description: 配电网重构是一个多目标、多时段、多组合、多约束的非线性优化问题。该问题的复杂性,决定了难以用单纯的数学方法得到满意的解。尝试用改进的遗传算法进行配电网络重构,建立评价函数,寻求该评价函数最优解-Distribution network reconfiguration is a multi-objective, multi-slot, multi-portfolio, multi-constrained nonlinear optimization problem. The complexity of the issue, a difficult decision purely mathematical methods satisfactory solution. Try to use improved genetic algorithm for distribution network reconfiguration, the establishment of the evaluation function, evaluation function to find the optimal solution
Platform: | Size: 6144 | Author: 王一 | Hits:

[matlabanquanguohe

Description: 先定义允许状态S={(x,y)|x=0或3,y=0,1,2,3 x=y=1,2}, 允许决策D={(u,v)|u+v=1,2},求dk<-D(k=0,1,2,…,n),使 状态Sk<-S按照状态转移律S(k+1)=S(k)+(-1)^k*dk,由初始状态 S1=[3,3]经有限步到达状态S(n+1)=[0,0].此为求解多步决策问题- First define to allow the state S = ((x, y) | x = 0 or 3, y = 0,1,2,3 x = y = 1,2), to allow the decision-making D = ((u, v) | u+ v = 1,2), seek dk < -D (k = 0,1,2, ..., n), so that state Sk < -S state transition in accordance with law S (k+1) = S (k )+ (-1) ^ k* dk, from the initial state S1 = [3,3] by the finite-step to reach the status S (n+1) = [0,0]. This is a multi-step decision-making problem solving
Platform: | Size: 1024 | Author: linjun | Hits:

[Software Engineeringbyljc

Description: 本书共分5章。第1章介绍了博弈论的基本概念和几个典型的例子。第2章和第3章分别介绍了完全信息下的静态博弈和动态博弈;第4章和第5章则介绍了不完全信息下的静态博弈和动态博弈。-This book introduces one of the most powerful tools of modern economics to a wide audience: those who will later construct or consume game-theoretic models. Robert Gibbons addresses scholars in applied fields within economics who want a serious and thorough discussion of game theory but who may have found other works overly abstract. Gibbons emphasizes the economic applications of the theory at least as much as the pure theory itself formal arguments about abstract games play a minor role. The applications illustrate the process of model building--of translating an informal description of a multi-person decision situation into a formal game-theoretic problem to be analyzed. Also, the variety of applications shows that similar issues arise in different areas of economics, and that the same game-theoretic tools can be applied in each setting. In order to emphasize the broad potential scope of the theory, conventional applications from industrial organization have been largely replaced b
Platform: | Size: 18432 | Author: 王密码 | Hits:

[OtherMultiple-Objective-Decision

Description: 介绍决策的基本理论、多目标最优化基本概念、求解非劣集的方法、有总体选好信息的求解方法、基于局部选好信息的交互式方法、 多属性问题求解方法、模糊多目标优化问题等-Introduced the basic theory of decision-making, multi-objective optimization of the basic concepts, methods of solving the non-inferior set, overall selected method for solving the local selecting information-based interactive, multi-attribute problem solving method, fuzzy multi-objective optimization problem wait
Platform: | Size: 3049472 | Author: 何婵 | Hits:

[Finance-Stock software systemDecisionTree

Description: 清楚显示出项目所有可供选择的行动方案,行动方案之间的关系,行动方案的后果,后果发生的概率,以及每种方案的损益期望值;使纷繁复杂的决策问题变得简单、明了,并且有理有据;用数据说话,形成科学的决策,避免单纯凭经验、凭想象而导致的决策上的失误。-Clearly shows all options for the project action plan, the relationship between the action program, the consequences of action programs, the consequences probability of occurrence, as well as profit and loss expectations for each program make complicated decision-making problem becomes simple, clear, and reasoned speak with the data, a scientific decision-making, to avoid simple rule of thumb, with imagination as a result of decision-making errors.
Platform: | Size: 1024 | Author: XWD | Hits:

[OtherApplied-Markov-Decision-Processes

Description: 本书从简单的例子开始 ,介绍了马尔可夫决策过程的基本概念、决策过程以及一些常用 的基本理论 .还介绍了多种最优准则 , 包括有限阶段准则、折扣准则、平均准则、权重报酬准 则、概率准则等 .从模型角度考虑了有限状态空间、可数状态空间和一般 Borel 状态空间 从 决策时间上来说 , 考虑了离散时间、连续时间和半马氏决策时刻问题 .本文还介绍了大量的应 用实例以及建模方法 .本书可作为高年级大学生和研究生教材 , 也可作为运筹学、管理科学、 信息科学、系统科学以及计算机科学和工程领域的学者和技术人员的参考书 . -From the simple example of this book introduces the basic concepts of Markov decision processes, and decision-making process as well as some common basic theory also describes the various optimal criteria, including criteria for limited stage, discounted, average criteria weights remuneration The guidelines, such as the probability criterion from the point of view of the finite state model space countable state space and general Borel state space from the decision-making time, consider a discrete-time, continuous-time and half-time Markov decision problem this article describes. a large number of application examples and modeling methods. book can serve as senior undergraduate and graduate teaching, but also as research, reference management science, information science, system science, and academics and technical staff in computer science and engineering fields.
Platform: | Size: 1283072 | Author: 何鹏飞 | Hits:

[matlabMulti-objective-decision

Description: 多目标决策法,灰色系统理论中灰色决策的一种,用于解决多目标决策问题-Multi-objective decision, a kind of grey decision-making in the grey system theory, used to solve multi-objective decision-making problem
Platform: | Size: 1024 | Author: 张亿 | Hits:

[File FormatMulti-criteria

Description: 针对具有语言评价信息、准则权系数部分已知的多准则决策问题, 提出一种基于前景理论及云模型的决策 方法. 首先, 通过给出一种改进的云模型生成方法将语言评价值转化为云模型 然后, 通过定义云模型距离和可能度 给出云前景价值, 并以其他备选方案为动态参考点, 构建云前景决策矩阵 最后, 在依据离差最大化得出最优权系数的基础上, 通过各方案综合前景值对其进行排序. 算例验证了所提出方法的合理性和可靠性.-For the risky multi-criteria decision-making problem in which the criteria value is linguistic variables, and the weighted coefficients are partially known, a decision-making approach based on the prospect theory and the cloud model is proposed. An improved method for generating cloud is proposed, and the linguistic variables are converted into the cloud model based on this method. After that, the cloud distance and the cloud comparison rule are defined. Then, the prospect value function of the cloud model can be defined, and the prospect decision matrix is constructed based on all other alternatives as the dynamic reference point. On the basis of the optimal criteria weights attained by the algorithm of maximizing deviation, the order of alternatives can be listed by comparing the integrated prospect values of each alternative. Finally, an example is illustrated to verify the rationality and reliability of the proposed method.
Platform: | Size: 207872 | Author: 王萌 | Hits:

[File Formathigh-order-Newton-type-methods

Description: 针对具有语言评价信息、准则权系数部分已知的多准则决策问题, 提出一种基于前景理论及云模型的决策 方法. 首先, 通过给出一种改进的云模型生成方法将语言评价值转化为云模型 然后, 通过定义云模型距离和可能度 给出云前景价值, 并以其他备选方案为动态参考点, 构建云前景决策矩阵 最后, 在依据离差最大化得出最优权系数的基础上, 通过各方案综合前景值对其进行排序. 算例验证了所提出方法的合理性和可靠性.-For with linguistic assessment information on weights section known multi-criteria decision making problem, a decision-making method prospect theory and cloud model. First, by giving an improved method for generating cloud model uation value is converted to the language cloud model then, by definition of the cloud model range and may cloud prospects given value, and other options for the dynamic reference point, the prospects for building cloud decision matrix Finally, based on maximizing deviations derived optimal weights based on the prospect of value through comprehensive programs of its sort. numerical example of the proposed method is reasonable and reliable.
Platform: | Size: 1108992 | Author: 王萌 | Hits:

[MultiLanguagebp

Description: 针对样本决策库数据量大的问题选用基于粗糙集对提取的样本数据进行离散化-Sample library data for decision-making problem of large sample selection based on rough sets were discrete data extraction
Platform: | Size: 1024 | Author: 马吴永 | Hits:
« 12 3 »

CodeBus www.codebus.net